An Augmented Lagrangian Approach for Scheduling Problems (Application to Total Weighted Tardiness Problems)
نویسندگان
چکیده
منابع مشابه
An Augmented Lagrangian Approach to Linearized Problems in Hydrodynamic Stability
The solution of linear systems arising from the linear stability analysis of solutions of the Navier–Stokes equations is considered. Due to indefiniteness of the submatrix corresponding to the velocities, these systems pose a serious challenge for iterative solution methods. In this paper, the augmented Lagrangian-based block triangular preconditioner introduced by the authors in [2] is extende...
متن کاملScheduling a variant of flowshop problems to minimize total tardiness
This paper studies no-wait flowshop scheduling problems to minimize total tardiness. This paper mathematically formulates the problem as an effective mixed integer linear programming model. Moreover, this paper proposes solution methods based on variable neighborhood search and simulated annealing algorithms. Besides, some well-known heuristics of classical flow shops are adapted to the case of...
متن کاملAn Integrated Column Generation and Lagrangian Relaxation for Solving Flowshop Problems to Minimize the Total Weighted Tardiness
In this paper, we address a new integration of column generation and Lagrangian relaxation for solving flowshop scheduling problems to minimize the total weighted tardiness. In the proposed method, the initial columns are generated by using near-optimal dual variables for linear programming relaxation of Dantzig-Wolfe decomposition derived by the Lagrangian relaxation method. The column generat...
متن کاملApproximation algorithms for scheduling problems with a modified total weighted tardiness objective
We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the new objective has a natural interpretation in Just-In-Time production systems.
متن کاملAn Improved Augmented Neural-Network Approach for Scheduling Problems
n : Number of tasks m : Number of machines k : Current iteration T : Set of tasks = {1,..,n} M : Set of machines = {1,..,m} Tj : j task node, j ∈ T Mij : Node for machine i connected from Tj, i ∈ M, j ∈ T Lj : Level of Tj, j ∈ T (number of tasks in the remaining path till the final node) LETj : Level with estimated time of Tj, j ∈ T (processing rime of the remaining path) ωj : Weight on the lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JSME International Journal Series C
سال: 2005
ISSN: 1344-7653,1347-538X
DOI: 10.1299/jsmec.48.299